How to compute the rank of a Delaunay polytope
نویسندگان
چکیده
Roughly speaking, the rank of a Delaunay polytope (first introduced in [2]) is its number of degrees of freedom. In [3], a method for computing the rank of a Delaunay polytope P using the hypermetrics related to P is given. Here a simpler more efficient method, which uses affine dependencies instead of hypermetrics is given. This method is applied to classical Delaunay polytopes. Then, we give an example of a Delaunay polytope, which does not have any affine basis.
منابع مشابه
0 Quadratic forms of rank 1 , closed zones and laminae
For a given lattice, we establish an equivalence involving a closed zone of the corresponding Voronoi polytope, a lamina hyperplane of the corresponding Delaunay partition and a quadratic form of rank 1 being an extreme ray of the corresponding L-type domain. 1991 Mathematics Subject classification: primary 52C07; secondary 11H55 An n-dimensional lattice determines two normal partitions of the ...
متن کاملPerfect Delaunay Polytopes and Perfect Quadratic Functions on Lattices
A polytope D, whose vertices belong to a lattice of rank d, is Delaunay if it can be circumscribed by an ellipsoid E with interior free of lattice points, and so that the vertices of D are the only lattice points on the quadratic surface E. If in addition E is uniquely determined by D, we call D a perfect Delaunay polytope. Thus, in the perfect case, the lattice points on E, which are the verti...
متن کاملDelaunay Supertopes
A perfect inhomogeneous quadratic form is defined by that it can be reconstructed in a unique way from its arithmetic minimum and all integral vectors on which it is attained. Such a form defines an integral Delaunay polytope that has a remarkable property of having a unique circumscribed ellipsoid whose interior is free of integral points. A polytope with this uniqueness property is called a p...
متن کاملCooperating Multi-Core and Multi-GPU in the Computation of the Multidimensional Voronoi Adjacency in Machine Learning Datasets
A cooperative framework is presented in this paper where multiple Cores in host and multiple GPUs cooperate to compute the Voronoi adjacency relationship in multidimensional Machine Learning datasets. Voronoi adjacency plays a very important role in neighbor based procedures in classification and data condensation. The proposal includes a system of Polytope Inclusion Agents, which computes the ...
متن کاملThe six-dimensional Delaunay polytopes
Given a lattice L, a full dimensional polytope P is called a Delaunay polytope if the set of its vertices is S ∩ L with S being an empty sphere of the lattice. Extending our previous work [DD01] on the hypermetric cone HY P7, we classify the six-dimensional Delaunay polytopes according to their combinatorial type. The list of 6241 combinatorial types is obtained by a study of the set of faces o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 28 شماره
صفحات -
تاریخ انتشار 2007